Security as Completeness

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Security specification: completeness, feasibility, refinement

The formal methods and refinement community should be able to contribute to the specification and verification of cryptography based security protocols. This paper describes a few of the challenges that arise in this context. These include: security properties which differ from one application to another, and as a consequence issues of specification completeness; approximate rather than absolut...

متن کامل

Towards a Completeness Result for Model Checking of Security Protocols

Model checking approaches to the analysis of security protocols have proved remarkably successful. The basic approach is to produce a model of a small system running the protocol, together with a model of the most general intruder who can interact with the protocol, and then to use a state exploration tool to search for attacks. This has led to a number of new attacks upon protocols being disco...

متن کامل

Completeness of the Negation as Failure Rule

Let P be a Horn clause log ic program and comp(p) be i t s completion in the sense of Clark. Clark gave a j u s t i f i c a t i o n fo r the negation as f a i l u r e ru le by showing that if a ground atom A is in the f i n i t e f a i l u r e set of P, then ~A is a l o g i c a l consequence of comp(P), that i s , the negation as f a i l u r e ru le is sound. We prove here that the converse als...

متن کامل

Strong Preservation as Completeness in Abstract Interpretation

Many algorithms have been proposed to minimally refine abstract transition systems in order to get strong preservation relatively to a given temporal specification language. These algorithms compute a state equivalence, namely they work on abstractions which are parti-transition systems in order to get strong preservation relatively to a given temporal specification language. These algorithms c...

متن کامل

Completeness and quasi-completeness

The appropriate general completeness notion for topological vector spaces is quasi-completeness. There is a stronger general notion of completeness, which proves to be too strong in general. For example, the appendix shows that weak-star duals of infinite-dimensional Hilbert spaces are quasi-complete, but never complete in the stronger sense. Quasi-completeness for Fréchet spaces is ordinary me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Pragmatism and American Philosophy

سال: 2017

ISSN: 2036-4091

DOI: 10.4000/ejpap.1009